Fast One-Parameter Variant of Preconditioned Uzawa Method with a Scaled Preconditioner for Saddle Point Problems
نویسنده
چکیده
In this paper, we propose a fast one-parameter variant of preconditioned Uzawa (OVPU) method with a scaled preconditioner for solving the saddle point problems, and then we present its convergence region and a formula for finding its optimal parameter. Also performance of the proposed OVPU method with a scaled preconditioner is compared with the existing one or two parameter iterative methods with optimal parameters to examine its efficiency. Mathematics Subject Classification: 65F10, 65F50
منابع مشابه
Acceleration of One-parameter Relaxation Methods for Singular Saddle Point Problems
In this paper, we first introduce two one-parameter relaxation (OPR) iterative methods for solving singular saddle point problems whose semi-convergence rate can be accelerated by using scaled preconditioners. Next we present formulas for finding their optimal parameters which yield the best semi-convergence rate. Lastly, numerical experiments are provided to examine the efficiency of the OPR m...
متن کاملOn preconditioned Uzawa methods and SOR methods for saddle-point problems
This paper studies convergence analysis of a preconditioned inexact Uzawa method for nondi erentiable saddle-point problems. The SOR-Newton method and the SOR-BFGS method are special cases of this method. We relax the Bramble– Pasciak–Vassilev condition on preconditioners for convergence of the inexact Uzawa method for linear saddle-point problems. The relaxed condition is used to determine the...
متن کاملOptimization of the parameterized Uzawa preconditioners for saddle point matrices
The parameterized Uzawa preconditioners for saddle point problems are studied in this paper. The eigenvalues of the preconditioned matrix are located in (0, 2) by choosing the suitable parameters. Furthermore, we give two strategies to optimize the rate of convergence by finding the suitable values of parameters. Numerical computations show that the parameterized Uzawa preconditioners can lead ...
متن کاملA Modified Preconditioner for Parameterized Inexact Uzawa Method for Indefinite Saddle Point Problems
The preconditioner for parameterized inexact Uzawa methods have been used to solve some indefinite saddle point problems. Firstly, we modify the preconditioner by making it more generalized, then we use theoretical analyses to show that the iteration method converges under certain conditions. Moreover, we discuss the optimal parameter and matrices based on these conditions. Finally, we propose ...
متن کاملNonlinear Inexact Uzawa Algorithms for Linear and Nonlinear Saddle-point Problems
This paper proposes some nonlinear Uzawa methods for solving linear and nonlinear saddle-point problems. A nonlinear inexact Uzawa algorithm is first introduced for linear saddlepoint problems. Two different PCG techniques are allowed in the inner and outer iterations of the algorithm. This algorithm is then extended for a class of nonlinear saddle-point problems arising from some convex optimi...
متن کامل